On Codes with Given Minimum Distance and Covering Radius
نویسنده
چکیده
Codes with minimum distance at least d and covering radius at most d− 1 are considered. The minimal cardinality of such codes is investigated. Herewith, their connection to covering problems is applied and a new construction theorem is given. Additionally, a new lower bound for the covering problem is proved. A necessary condition on an existence problem is presented by using a multiple covering of the farthest-off points.
منابع مشابه
Normal and abnormal codes
It is proved that codes of length n, covering radius Z?, and minimum Hamming distance 2R-1 are normal if R does not divide n. Constructions for abnormal codes with covering radius R and minimum Hamming distance at least R-l are given.
متن کاملOn Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes
We consider upper bounds on two fundamental parameters of a code; minimum distance and covering radius. New upper bounds on the covering radius of non-binary linear codes are derived by generalizing a method due to S. Litsyn and A. Tiett avv ainen 10] and combining it with a new upper bound on the asymptotic information rate of non-binary codes. The new upper bound on the information rate is an...
متن کاملGraphs Associated with Codes of Covering Radius 1 and Minimum Distance 2
The search for codes of covering radius 1 led Österg̊ard, Quistorff and Wassermann to the OQW method of associating a unique graph to each code [9]. We present results on the structure and existence of OQW-associated graphs. These are used to find an upper bound on the size of a ball of radius 1 around a code of length 3 and minimum distance 2. OQW-associated graphs and non-extendable partial La...
متن کاملCovering radius construction codes with minimum distance at most 8 are normal
In this paper we introduce the class of covering radius (CR)-codes as a generalization of greedy codes. First we show how a CR−code is constructed and introduce some basic terminology. Some properties which are satisfied by these codes are then discussed. We review the property of normality for codes and show that CR−codes with minimum distance at most 8 are normal.
متن کاملOn the covering radius of some binary cyclic codes
We compute the covering radius of some families of binary cyclic codes. In particular, we compute the covering radius of cyclic codes with two zeros and minimum distance greater than 3. We compute the covering radius of some binary primitive BCH codes over F2f , where f = 7, 8.
متن کامل